Signal power reduction systems and methods

ABSTRACT

A method of reducing transmission power for an encoded data stream includes the steps of receiving an incoming data stream having equal probability for a plurality of incoming data bits, assigning a symbol scheme to the received data bits of the incoming data stream according to probabilities of occurrence of individual ones of the received data bits, and transmitting an outgoing data stream according to the assigned symbol scheme having a second average transmit power, different than the first average transmit power, for a plurality of outgoing symbols.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/031,873, filed Jul. 10, 2018, which application is a continuation ofU.S. patent application Ser. No. 15/345,326, filed Nov. 7, 2016, whichprior application claims the benefit and priority to U.S. ProvisionalPatent Application Ser. No. 62/252,107, filed Nov. 6, 2015, thedisclosures of which are herein incorporated by reference in theirentireties.

BACKGROUND

The field of the disclosure relates generally to data transmissionsystems, and more particularly, to data transmission systems utilizinginput data and outputs symbol streams.

Conventional data transmission systems typically determine data capacityfor communication lines according to available transmit power. Withdeployment of improved cable taps and improved amplifiers,communications services now contemplate utilizing bandwidths over 1gigahertz (GHz). For high-speed internet services, bandwidthrequirements for delivering high-speed data and video services overaccess networks are rapidly increasing to meet growing residential andbusiness consumer demands. However, in some conventional datatransmission systems, elevated data signal attenuation, combined signalnoise, and limited transmit power function together to reduce datathroughput for both upstream and downstream signals.

It is therefore difficult, in conventional data transmission systems forcommunications services, to determine the maximum data capacityavailable over a communication line where, for example, a user'stransmit power is limited, but excess bandwidth is available.

BRIEF SUMMARY

A method of reducing transmission power for an encoded data streamincludes the steps of receiving an incoming data stream having a firstaverage transmit power for a plurality of incoming data bits, assigninga symbol scheme to the received data bits of the incoming data streamaccording to probabilities of occurrence of individual ones of thereceived data bits, and transmitting an outgoing data stream accordingto the assigned symbol scheme having a second average transmit power,different than the first average transmit power, for a plurality ofoutgoing symbols.

In another aspect, a symbol transmission system for an encoded datastream includes a memory and a processor. The processor iscommunicatively coupled with the memory, and is programmed to executeinstructions to receive an incoming data stream, determine a probabilityof a binary bit stream represented by the incoming data stream, assign asymbol scheme to the binary bit stream based on the determinedprobability, and transmit an outgoing data stream according to theassigned symbol scheme.

In a further aspect, a method of reducing transmission power for a datastream having a plurality of equally probable states includes the stepsof determining the average power required to transmit an individual oneof the plurality of equally probable states, calculating the timerequired to transmit each one of the plurality of equally probablestates, and reducing the transmission time for at least one state of theplurality of equally probable states.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features, aspects, and advantages of the presentdisclosure will become better understood when the following detaileddescription is read with reference to the following accompanyingdrawings, in which like characters represent like parts throughout thedrawings.

FIG. 1 is a graphical illustration of an exemplary quadrature amplitudemodulation (QAM) scheme for assigning symbols to a binary data stream.

FIG. 2 is a graphical illustration of a probability curve fortransmitted data stream, according to an embodiment.

FIG. 3 is a graphical illustration of a probability distribution of alaser-based fiber optic data transmitter according to the embodimentdepicted in FIG. 2.

FIG. 4 is a schematic illustration depicting an exemplary symboltransmission process, according to an embodiment.

FIG. 5 is a schematic illustration depicting an exemplary symboltransmission process, according to an alternative embodiment.

FIG. 6 is a schematic illustration of an exemplary symbol transmissionsystem, according to an embodiment.

Unless otherwise indicated, the drawings provided herein are meant toillustrate features of embodiments of this disclosure. These featuresare believed to be applicable in a wide variety of systems including oneor more embodiments of this disclosure. As such, the drawings are notmeant to include all conventional features known by those of ordinaryskill in the art to be required for the practice of the embodimentsdisclosed herein.

DETAILED DESCRIPTION

In the following specification and the claims, reference will be made toa number of terms, which shall be defined to have the followingmeanings.

The singular forms “a,” “an,” and “the” include plural references unlessthe context clearly dictates otherwise.

“Optional” or “optionally” means that the subsequently described eventor circumstance may or may not occur, and that the description includesinstances where the event occurs and instances where it does not.

Approximating language, as used herein throughout the specification andclaims, may be applied to modify any quantitative representation thatcould permissibly vary without resulting in a change in the basicfunction to which it is related. Accordingly, a value modified by a termor terms, such as “about,” “approximately,” and “substantially,” are notto be limited to the precise value specified. In at least someinstances, the approximating language may correspond to the precision ofan instrument for measuring the value. Here and throughout thespecification and claims, range limitations may be combined and/orinterchanged; such ranges are identified and include all the sub-rangescontained therein unless context or language indicates otherwise.

As used herein, the terms “processor” and “computer” and related terms,e.g., “processing device”, “computing device”, and “controller” are notlimited to just those integrated circuits referred to in the art as acomputer, but broadly refers to a microcontroller, a microcomputer, aprogrammable logic controller (PLC), an application specific integratedcircuit (ASIC), and other programmable circuits, and these terms areused interchangeably herein. In the embodiments described herein, memorymay include, but is not limited to, a computer-readable medium, such asa random access memory (RAM), and a computer-readable non-volatilemedium, such as flash memory. Alternatively, a floppy disk, a compactdisc-read only memory (CD-ROM), a magneto-optical disk (MOD), and/or adigital versatile disc (DVD) may also be used. Also, in the embodimentsdescribed herein, additional input channels may be, but are not limitedto, computer peripherals associated with an operator interface such as amouse and a keyboard. Alternatively, other computer peripherals may alsobe used that may include, for example, but not be limited to, a scanner.Furthermore, in the exemplary embodiment, additional output channels mayinclude, but not be limited to, an operator interface monitor.

Further, as used herein, the terms “software” and “firmware” areinterchangeable, and include any computer program storage in memory forexecution by personal computers, workstations, clients, and servers.

As used herein, the term “non-transitory computer-readable media” isintended to be representative of any tangible computer-based deviceimplemented in any method or technology for short-term and long-termstorage of information, such as, computer-readable instructions, datastructures, program modules and sub-modules, or other data in anydevice. Therefore, the methods described herein may be encoded asexecutable instructions embodied in a tangible, non-transitory, computerreadable medium, including, without limitation, a storage device and amemory device. Such instructions, when executed by a processor, causethe processor to perform at least a portion of the methods describedherein. Moreover, as used herein, the term “non-transitorycomputer-readable media” includes all tangible, computer-readable media,including, without limitation, non-transitory computer storage devices,including, without limitation, volatile and nonvolatile media, andremovable and non-removable media such as a firmware, physical andvirtual storage, CD-ROMs, DVDs, and any other digital source such as anetwork or the Internet, as well as yet to be developed digital means,with the sole exception being a transitory, propagating signal.

Furthermore, as used herein, the term “real-time” refers to at least oneof the time of occurrence of the associated events, the time ofmeasurement and collection of predetermined data, the time for acomputing device (e.g., a processor) to process the data, and the timeof a system response to the events and the environment. In theembodiments described herein, these activities and events occursubstantially instantaneously.

FIG. 1 is a graphical illustration of an exemplary constellation diagram100 for a quadrature amplitude modulation scheme (QAM) for encodingbinary digital data. In the example shown, for ease of illustration,constellation diagram 100 is a 16-state QAM, or 16-QAM, system. Inalternative embodiments, the principles disclosed herein are scalableand may be applied to other modulation systems of 64-QAM, 256-QAM,1024-QAM, 4096-QAM, or even 32768-QAM or greater, OFDM (orthogonalfrequency division-multiplexing) or VSB (vestigial sideband).

In the exemplary embodiment shown, constellation diagram 100 plots halfbyte length groups, i.e., four bits, of ones (1's) and zeros (0's)arranged in four quadrants of a Q (quadrature) vs. I (in-phase) axis ofthe constellation, and into 16 states 104 about a constellation origin102. Each state of the 16 states 104 occupies a Q-I point onconstellation diagram 100 where a radial distance of the Q-I point fromconstellation origin 102 corresponds to amplitude, and an angle of theQ-I point relative to the positive I-axis corresponds to phase,respectively, of a signal waveform transmitting the information of theparticular state 104. The greater the radial distance is fromconstellation origin 102 to a Q-I point on constellation diagram 100,the greater the amplitude, and thus electrical power, required totransmit a symbol corresponding to the particular state 104. Inparticular, power is proportional to distance (voltage) squared. In the16-QAM example illustrated, four respective amplitude magnitudes (notseparately numbered) are utilized for transmitting hexadecimal symbols“0” to “15” range from 1+j to 3+3j, with intermediate values of 1+3j and3+j.

Accordingly, in constellation diagram 100, an arbitrary symbol can beassigned to each state 104 of the sixteen. For example, symbols “0” to“15” (denoted in parentheses in FIG. 1) are assigned to each state 104of the sixteen, respectively, and each state 104 therefore has anapproximately equal probability of occurring in a binary digital datastream of arbitrary length.

Table 1, below, depicts the sixteen possible states 104.

TABLE 1 Symbol State 0 0000 <<Start of sampling frame 1 0001 2 0010 30011 4 0100 5 0101 6 0110 7 0111 8 1000 9 1001 X (transmitter transmitsonly at this time slot) 10 1010 11 1011 12 1100 13 1101 14 1110 15 1111<<End of sampling frame

As shown in Table 1, 16 4-bit states (e.g., states 104, FIG. 1), arepossible from 16-QAM constellation diagram 100. In conventional systems,transmission of a data stream under this scheme requires a transmitter(not shown) and a receiver (not shown) to essentially play “a guessinggame” as to which row in Table 1 is to be selected for transmission.Using a synchronized frame with 16 equally spaced time slots, when thetransmitter reaches the 4-bit state 104 desired to be sent, it transmitsa signal using, for example, 1 W of transmit power. At all other times,the transmitter transmits 0 W. In the example of Table 1, therefore, the“X” indicated in the rightmost column represents the transmissiontimeslot. Accordingly, the average power to transmit any particularstate 104 for 4 bits of information is 1/16 of a Watt, or 0.0625 W. Thatis, each state 104 has a 1/16 probability of occurring, on average. Whencomparing this 1/16 average probability with the basic ½ probability ofa binary data bit being transmitted (see FIG. 2, below), a significanttime penalty is experienced by conventional systems as constellationdiagrams increase in scale.

FIG. 2 is a graphical illustration of a probability curve 200 of abinary entropy function, H_(b)(p), representing respective probabilitiesof “1” and “0” occurring from a transmitted binary data stream (seeFIGS. 4, 5, below). Probability curve 200 depicts H_(b)(p) as theentropy H (y-axis) for an effective number of bits per symboltransmitted versus a probability p (x-axis) of a “1” state occurring ina stream of binary digital data of arbitrary length. In a 2-state binaryamplitude-shift keying (BASK) encoding scheme, where a “0” state symbolcorresponds to a zero signal waveform amplitude, or “off,” requiringsubstantially 0 transmit power (i.e., other than a basal threshold powervalue necessary to maintain system operation), and where a “1” statesymbol corresponds to a non-zero valued signal waveform amplitude, or“on,” and a non-zero required transmit power, each available state(e.g., state 104, FIG. 1) will experience an equal probability ofoccurring, on average, over time.

In the BASK encoding scheme example, which can be implemented using alaser to transmit data over a fiber optic line (not shown), theexemplary values described with respect to Table 1, above, are againpresumed for purposes of explanation. That is, transmission of the “1”state will transmit 1 W of power over a laser (not shown) for a givenperiod of time, whereas transmission of the “0” state symbol requires 0W of power, or that the laser is “off” (i.e. biased down to thresholdcurrent) for the given period. In such cases where the data to beencoded and transmitted has approximately equal occurrence probabilitiesof 1 and 0 (i.e., p=0.5), the transmitter (e.g., laser-based fiberoptic) operates at a point 202 on probability curve 200, and the averagetransmit power will be 0.5 W. The time penalty discussed above withrespect to table 1 thus becomes apparent when comparing this 0.5probability with the 0.0625 ( 1/16) probability of the 16-QAM example.

Referring back to probability curve 200, where point 202 represents atypical probability of a “1” state symbol (i.e., “laser on”) beingp=0.5, point 204 represents the same transmission, but at p=0.25, thatis, a ¼ probability. In this example, H (y-axis) for point 204 isreduced from 1.0 to 0.8, or 20 percent, while the probability p (x-axis)is reduced from 0.5 to 0.25, or 50 percent, for point 204 relative topoint 202. The practical effect of reducing p from 0.5 to 0.25 is todecrease the average transmit power by half (from 0.5 W to 0.25 W),which is equivalent to a reduction of 3 decibels (dB) in this examplewhere 1 W equals the power to transmit a “1.” According to thisexemplary embodiment though, H is disproportionately decreased by only20 percent in light of the parabolic shape of probability curve 200. Inother words, greater savings in power reduction can be achieved than theamount of information (bits) lost by shifting the probability leftwardalong probability curve 200.

Utilizing these principles for a 16-QAM scheme (e.g., constellationdiagram 100, FIG. 1), each unique half byte string of four bits isencoded as one symbol of the sixteen available signal states (e.g.,states 104). Thus, given one synchronized sampling frame of a digitalsignal processor (DSP) and/or analog-to-digital converter (ADC), eachhalf byte string of binary digital data to be transmitted has anapproximately equal probability (i.e., p= 1/16) of occurrence in therespective sampling time. Thus, the inner four states have a probabilityof 0.25, the outer four states also have a probability of 0.25, and themiddle states have a probability of 0.5. As the amount of informationper constellation is scaled upward, significant power savings can beachieved (see FIG. 3, below), but without proportional loss intransmitted information.

The Shannon Entropy, H, is the number of bits per symbol. It is givenby:

H=−Σ _(i) p _(i) log₂(p _(i))  (1)

So for the 16 equally probable states in FIG. 1, H=16*(0.0625)*4=4 bitsper symbol.

In conventional systems that have no practical constraints on availablepower for symbol transmission, these probabilities for symbol occurrenceand transmission power are of little consequence. However, as describedabove, increasing demand has made available transmission power moreconstrained, and thus advanced quadrature encoding schemes are unable tooptimize power usage because the aforementioned probability distributionremains static over time. Accordingly, systems and methods according tothe present embodiments are capable of realizing advantageous savingsand transmission power without experiencing significant proportionalloss of signal information.

FIG. 3 illustrates a graphical plot 300 representing operation of alaser-based fiber optic data transmitter utilizing the principlesdescribed above. More particularly, plot 300 represents the effect ofreducing the probability of a “1” state symbol from p=0.5 to p=0.25, asshown and described above with reference to FIG. 2. Plot 300 depicts anintensity (y-axis) of a communication laser as a function of electricalcurrent consumed (Amps, x-axis) by the laser, assuming the voltage dropof a laser diode is relatively constant. For simplification ofexplanation, intensity is illustrated in FIG. 3 as having a range ofvalues between 0 and 1, where “1” corresponds to the laser (not shown)being on and having a luminous intensity value above a predeterminedthreshold for a predetermined amount of time at a predeterminedwavelength for purposes of transmitting the “1” value. Similarly, laserintensity represented by the “0” value on the y-axis of plot 300corresponds to the laser having a luminous intensity value below thepredetermined threshold for a predetermined amount of time. Forsimplicity of this discussion, the threshold is shown at the zero value.In practical operation, lasers have a threshold current, below whichthey stop lasing.

In the exemplary embodiment of FIG. 3, current consumed by the laser isconsidered to be substantially proportional to laser intensity. A personof ordinary skill in the art would recognize and appreciate that laserintensity and its proportionality to current consumption finds analoguesin wireless and wired data transmission systems where, for example, andwithout limitation, an amplitude of a waveform is proportional toelectrical current and/or power used to transmit the waveform through amedium.

A conventional data transmission system therefore generally realizes, onaverage over time, an equal probability (p=0.5) that the laser of thesystem is transmitting power above the threshold intensity tocommunicate a “1” using a predetermined wavelength (e.g., 1550 nm foroptical fiber), that is, the laser is operating at full power forapproximately half the time during operation. Using the exemplaryassumptions described above, transmission of a “1” requires, forexample, 1 W of transmit power and the laser uses 1 volt (V), and anelectrical current (I) of 1 Amp is consumed while the laser transmits“1,” and this operational condition is represented by point 302 on plot300. Under the same exemplary assumptions, transmission of “0” requirestransmit power of approximately I-_(threshold) Amps, and thisoperational condition is represented by point 304 on plot 300.Accordingly, point 306 represents the average probability (p=0.5) lasertransmission occurring between points 302 and 304. Point 306 thusrepresents a conventional laser operating at an average current of 0.5Amps (using the 1 W example) consumed over the period the laser istransmitting a binary data stream. In other words, in the case ofoperating a binary communication laser, normal practice with p=0.5 is tobias the laser with the maximum average power and spend half the timejust above threshold level (e.g., substantially near 0 Amps) and halfthe time at twice the bias point (e.g., approximately 1 Amp).

In an exemplary embodiment, the symbol probability of transmitting athigher power, represented by point 302 in FIG. 3, is reduced from p=0.5to p=0.25. This probability reduction, that is, the amount of time thelaser is transmitting at an intensity below the equal probability point306, the similarly reduces the average consumed current to point 308,which is a significant consideration with data transmission systemsusing, for example, laser fiber optics, since the reduction in averagecurrent will similarly decrease the average transmit power over time.

This principle is further emphasized with reference again to FIG. 2. Asillustrated in FIG. 2, moving along probability curve 200 from point 202(p=0.5) to point 204 (p=0.25) presents a greater savings in transmittedpower (50 percent) than the amount of reduction in information bits andentropy H (from 1.0 to 0.8). The present embodiments are thereforesignificantly advantageous when utilized in a communication system withavailable bandwidth. For example, where an application can accept, onaverage, fewer bits per transmitted symbol, the laser will lessfrequently transmit at the higher power level represented by point 302in FIG. 3, where both the average current and light output by the laserare reduced.

The principles of the embodiments described herein are further usefulfor transmission in drop cables, in addition to fiber optic lines. Inboth transmission vehicles, for example, there is often excess bandwidthavailable for transmission, but limited electromagnetic energy. In otherwords, transmission concerns are not governed so much by how much dataneeds to be transmitted, but instead by how many bits are to be conveyed(without error) per joule of energy. Simply put, transmitting more Os(low power symbols) than is (higher power symbols) is a more efficientuse of limited electromagnetic energy.

This principle becomes even more apparent for higher-order quadratureconstellation signals. High-order QAM signals, for example, can populatecenter states (i.e., closer to the constellation origin) with a higherprobability than outside constellation points (i.e., further from origin102), reducing transmit current and power (RF) at the expense oftransmission capacity. Moreover, a variety of additional practicalbenefits flow from reducing p for transmission of binary data streams.For example, in a wireless transmission system, where battery life islimited but there may be excess bandwidth available (e.g., a rural areawith Wi-Fi), additional bandwidth can be used to transmit excess data(i.e., due to an increase in H) while simultaneously conserving batterypower.

The systems and methods described herein for reducing p for some of thesymbols can be contrasted with conventional methods of reducingcontinuous transmit power and reducing modulation order, e.g., from16-QAM with 4 bits per symbol to QPSK with 2 bits per symbol. That is,because the probability of all states must add up to 1, p is reduced forsome symbols, and correspondingly increased for others. Transmissionpower is then reduced by assigning the lowest power transmissionrequirements to the symbols having the highest probability ofoccurrence, as explained further below. In a wide variety ofcommunication systems, further benefits of reducing p for some of thesymbols as described herein are lower power operation for transmission,computing, memory, and encoding subsystems in a more efficient manner,thereby lowering operation temperature, and reducing operating andmaintenance costs. The aforementioned benefits, and additionaladvantages that would be recognized and appreciated by persons havingordinary skill in the art, offset disadvantages of reduced datatransmission rates due to reducing p for some of the symbols using thesystems and methods described herein.

FIG. 4 is a schematic illustration depicting an exemplary symboltransmission process 400. In an exemplary embodiment of process 400, anincoming data stream is embodied by a binary string 403 and can beencoded into four-symbol incoming symbol stream 402 using a QPSKencoding scheme 418. In QPSK encoding scheme 418, two bit groups of 1sand 0s are arranged in a 4-state QPSK constellation diagram 404 about anorigin 406. In this example, each state 405 of the 4-state QPSK occupiesa Q-I point on constellation diagram 404, and each state has an equalradial distance (e.g., R=1.0) from origin 406. For this example, thereare 4 possible states 405, labeled with symbols alpha (α), beta (β),gamma (γ), and delta (δ), respectively. Each state 405 represents 2bits, with each state having an approximately equal occurrenceprobability of 0.25. That is, each state 405 will realize anapproximately equal transmit current and transmit power, on average overtime.

In the example illustrated, for a randomly selected incoming binarystring 403 of 1s and 0s, having p=0.5 for each binary bit therein, isthus encoded by 4-state QPSK into a plurality of QPSK symbols 408 (α, β,γ, and δ) with four possible states 405 (denoted in FIG. 4 as 00, 01,10, and 11, respectively), resulting in a total of sixteen QPSK symbols.Assuming that one joule (J) of energy is used to transmit each symbol408, each individual bit transmitted therein uses 0.5 J. This QPSKtransmission scheme therefore realizes an energy efficiency of 0.5 J perbit.

In an exemplary embodiment, process 400 monitors incoming binary string403 and assigns a plurality of symbols 410 of a probability encodingscheme 420 as an outgoing data symbol stream 412. In an alternativeembodiment, process 400 monitors incoming symbol stream 402 and convertsincoming symbol stream 402 from the sixteen QPSK symbols 408 from theequal probability encoding scheme 418 into the plurality of convertedsymbols 410 of a different, unequal probability encoding scheme 420. Inthe exemplary embodiment, higher probability encoding scheme 418 isillustrated merely as reference to emphasize the advantageous resultsachieved by encoding scheme 420 on an incoming binary data string. Thedata stream of binary string 403, for example, may simply representreceived data that is intended for transmission. In the alternativeembodiment, process 400 instead may instead actively monitor an incomingsymbol stream (i.e., symbol stream 402) that requires a higher powertransmission, and convert the higher transmission power incoming symbols(i.e., symbols 408) into lower transmission power symbols (i.e., symbols410) for the outgoing transmission.

In an exemplary embodiment, the plurality of assigned or convertedsymbols 410 includes three, rather than four, distinct symbols (denotedA, B, and C in FIG. 4). That is, instead of the 4-state QPSK-encodeddata symbol stream 402 that would represent an equal probabilityassignment of symbols for binary string 403, to outgoing data symbolstream 412 has three states. Outgoing symbol stream 412 thus representsan encoding scheme (i.e., scheme 420) having a lower p value and, thusalso a lower H value (see FIG. 2), as compared with symbols 408 of the4-state and 4-symbol encoding scheme 418 required for symbol stream 402.

Outgoing symbol stream 412 of encoding scheme 420 is further depicted ina one-dimensional, or linear, 3-state constellation diagram 414.Constellation diagram 414 includes an origin 416 and three states 417.States 417(B) (10, symbol B) and 417(C) (11, symbol C) are equidistant(i.e., R=1.0) from state 417(A) (0, symbol A) at origin 406. In thecomparison to, or conversion from, incoming symbol stream 402, when a 0is encountered by process 400, state 417(A), which is at origin 416 andrequires no energy, is transmitted in outgoing symbol stream 412.Similarly, when the next two encountered bits are 10 (state 417(B)), a Bsymbol is transmitted, at 1 J, as a portion of outgoing symbol stream412. When though, the next two encounter bits are 11 (state 417(C)), a Csymbol is transmitted, also at 1 J, as a portion of outgoing symbolstream 412. It is significant to note though, that the probability of asymbol A is 0.5, whereas the respective probabilities of symbols B and Care both 0.25. Thus the Shannon entropy, H, can be calculated as 1.5bits per symbol, (0.25*2)+(0.25*2)+(1*0.5).

In an exemplary embodiment, for incoming symbol stream 402, a monitoringsystem (e.g., system 600, FIG. 6, below) can be programmed such that bitpairs 10 and 11 take precedence over a single-bit occurrence of 0 forconversion by process 400 because the 2-bit pairs (represented bysymbols B and C, respectively) have lower probabilities of occurrencewithin incoming symbol stream 402, and require greater energy and highertransmit power and current, relative to the single-bit occurrence of 0(represented by symbol A).

As described above, in an exemplary embodiment, symbol stream 402 isencoded with the equal symbol probability 4-state/4-symbol QPSK scheme418 with 2 bits per symbol. Symbol stream 402 can thus be represented asa two-dimensional (i.e., I and Q axes) on constellation diagram 404, ascompared with outgoing symbol stream 412, which can be represented as aone-dimensional (i.e., I axis only) constellation diagram 414representing the 3-state/3-symbol encoding scheme 418. A person ofordinary skill in the art will understand, after reading andcomprehending the present disclosure, that process 400 is not limited toonly a conversion from (or comparison with) 4-state scheme 418 into3-state scheme 420 with 1.5 bits per symbol, which is disclosed for easeof explanation. Rather, process 400 may be implemented, by considerationof the respective probabilities and transmission powers, to convert (orin consideration of) an incoming higher power symbol stream into a lowerpower symbol stream.

Additionally, in an exemplary embodiment, an average energy per bit of0.25 J can be realized (utilizing the same assumed values above) fortransmitting the 3-state scheme 420 of outgoing symbol stream 412, ascompared with an average energy per bit of 0.5 J that is required forthe 4-state scheme 418 of incoming symbol stream 402. In other words,utilization of process 400 reduces by half the electromagnetic energy ofoutgoing symbol stream 412 as compared with the electromagnetic energythat would be required to transmit the same binary string 403 as symbolstream 402.

Conventional systems have not approached such a solution due to the factthat it takes longer to send the same message using the lower powersymbol scheme than it does with the higher power symbol stream. That is,in the example illustrated in FIG. 4, approximately 23 symbols are usedby the 3-state encoding scheme 420, whereas 16 symbols are used in the4-state encoding scheme 418. The present inventors have discoveredthough, that many fiber optic systems are limited on transmission power,but retain unutilized excess bandwidth, thereby rendering process 400particularly advantageous in such instances. In other words, the longerduration to transmit the outgoing symbol stream can be equated withusing more bandwidth. This bandwidth-time product is a significantconsideration made available in systems and methods according thepresent embodiments.

Process 400 this transmits, instead of the equal probability symbolstream 402, outgoing symbol stream 412 having a mix of symbols 410 ofhigher power (B and C), but occurring with lower probability, andsymbols 410 of lower power (A), but occurring with a higher probability.By structuring the transmitted outgoing symbol stream such that thehigher power symbols occur with lower probability, the resultingoutgoing symbol stream 412 can be transmitted at a significantly lowerpower than would be required for an equal probability symbol stream,while only sacrificing a less significant percentage reduction of bitsper symbol and data transmission rate. Process 400 thus utilizes theadvantageous properties of outgoing symbol stream 412 by assigning lessprobable bit sequences (e.g., pairs 11 and 10) to symbols (B and C)requiring a higher transmission power, while assigning the more probablebit sequences (e.g., 0 occurrences) to symbols (A) requiring lowertransmission power. The present embodiments are able to monitor an inputdata stream and assign symbols to the highest power bit sequences suchthat the higher power bit sequences will be transmitted with lowerprobability than would their corresponding data bits in an equalprobability encoding scheme.

FIG. 5 is a schematic illustration depicting an alternative symboltransmission process 500. In an exemplary embodiment, process 500utilizes the same input binary string 403 as process 400 for outgoingsymbol transmission, as well as the comparison with symbol stream 402 todemonstrate reduction in transmission power. In this example, thecomparison reference of encoding scheme 418 utilizes the same two-bitgroups of 1s and 0s arranged in 4-state QPSK constellation diagram 404about origin 406, and each state 405 occupies a Q-I point onconstellation diagram 404 at an equal radial distance (e.g., R=1.0) fromorigin 406. Each state 405 again represents 2 bits, with each statehaving an approximately equal occurrence probability of 0.25, and anapproximately equal transmit current and transmit power, on average overtime, as well as an energy efficiency of 0.5 J per bit. Entropy, H, forthis system is 1.811 bits per symbol(0.125*3)+(0.125*3)+(0.375*1.415)+(0.375*1.415).

Process 500 monitors incoming symbol stream 402 and assigns a pluralityof symbols 502 of a different, lower probability encoding scheme 504 ascompared with the equal probability encoding scheme 418, discussedabove. In an example of this alternative embodiment, the plurality ofconverted symbols 502 includes four distinct symbols (denoted A, B, C,and Din FIG. 5). That is, in comparison with the QPSK-encodedequal-probability data symbol stream 402, an outgoing data symbol stream506 is transmitted that also has four states, but of unequalprobabilities. Outgoing data symbol stream 506 assigns symbols 502 suchthat lower power bit sequences will occur with higher relativeprobability than higher power bit occurrences, similar to process 400(FIG. 4).

In an exemplary embodiment, outgoing symbol stream 506 of encodingscheme 504 is depicted in a 4-level amplitude shift keying (ASK) table508 utilizing four symbols 502 (A, B, C, and D). In operation, table 508can be a lookup table in a processor (see FIG. 6, below) for assigningsymbols to received binary string 403, or may be a conversion process(e.g., from a higher power symbol scheme to a lower power symbol scheme)similar to that described above with respect to process 400 (FIG. 4).

In the example illustrated in FIG. 5, the 4-level ASK encoding scheme504 designates a signal amplitude of 0 volts (V) as corresponding to nodata being transmitted (or just above the base operating threshold,described above). In comparison to, or conversion from, symbol stream402, when a single 0 is encountered by process 500, symbol A (single-bitsequence of 0) is transmitted in outgoing symbol stream 506 with anamplitude of 1 V. Similarly, when a single 1 is encountered, symbol B(single-bit sequence of 1) is transmitted in outgoing symbol stream 506with an amplitude of −1 V. When a bit sequence of 000 is encountered,symbol C is transmitted in outgoing symbol stream 506 with amplitude of3 V. Similarly, encountering a bit sequence of 111 may prompt process500 to transmit symbol D in outgoing symbol stream 506 with an amplitudeof −3 V.

As illustrated in table 508, single-bit sequences 0 and 1 from binarystring 403 have the highest probability of occurring (p=0.375 each), andbit sequences 000 and 111 have a lower probability of occurring (p=0.125each). In an exemplary embodiment, for incoming binary string 403, amonitoring system (e.g., system 600, FIG. 6, below) can be programmedsuch that bit sequences 000 and 111 take precedence over single-bitoccurrences of 0 and 1 for assignment of outgoing symbols 502 by process500 because the 3-bit sequences (symbols C and D) have lowerprobabilities of occurrence within binary string 403 and require greaterenergy and higher transmit power and current relative to the 1-bitoccurrences (symbols A and B).

In an exemplary embodiment, implementation of process 500 allows for asignificant reduction in average transmitted energy, current, and powerthrough use of the 4-level ASK unequal probability encoding scheme 504on outgoing symbol stream 512, as compared with the 4-state equalprobability encoding scheme 418. For an incoming binary string (e.g.,string 403) of arbitrary length, the probability of occurrence of eachindividual QPSK symbol 408 (α, β, γ, and δ) is the same, namely p=0.5.In contrast, converted symbols 502 (A, B, C, D) do not have equalprobabilities of occurrence. Again, on average, the probabilities ofencountering the 3-bit groups of 000 (symbol C) and 111 (symbol D) areeach approximately 0.125, while the probabilities of encountering thesingle-bit occurrences of 0 or 1 are each approximately 0.375. As in theexamples described above, power is proportional to voltage squared, anda resistance of 1 ohm is assumed to simplify calculations. Using theseaverage probabilities, and assuming 1 W of power is used to transmiteach symbol in both 4-state QPSK encoding and 4-level ASK encoding(again, using the same simplified assumptions described above), asignificant reduction in transmit energy, current, and power is obtainedby reducing p of outgoing symbol stream 506.

For comparison purposes, further advantages of encoding scheme 504 canbe understood with reference to analogous states under a conventionalASK encoding scheme. For example, in the conventional equal probabilityscheme, the A symbol would be assigned to the bit sequence “01” (+1 V),the B symbol would be assigned to the bit sequence “10” (−1 V), the Csymbol would be assigned to the bit sequence “00” (+3 V), and the Dsymbol would be assigned to the bit sequence “11” (−3 V). Thisconventional scheme, all four bit sequences will have an equaloccurrence probability, that is ¼ each, or p=0.25, and Shannon entropyis 2.

For this 4-level ASK equal probability example, assuming a loadresistance of 1 ohm, the probability of a C or a D is 0.25 with a powerof 9 (3 volts squared) and the probability of an A or a B is 0.25 with apower of 1 (1 volt squared). Given these equal occurrence probabilities,an average power of 5 watts will be used for transmission.

In contrast, for the 4-level ASK unequal probability example, theprobability of a “1” or “0” is 0.375 with a power of 1 watt, and theprobability of a “000” or “111” is 0.125 with a power of 9 watts. Giventhese unequal occurrence probabilities for the four available symbols502, an average power of 3 watts will be used for transmission, which isapproximately a 40 percent power reduction, and a significantimprovement over conventional transmission techniques.

Similar to process 400, described above with respect to FIG. 4, process500 utilizes 20 symbols for the unequal probability ASK encoding scheme504, whereas 16 symbols are used in the 4-state QPSK encoding scheme 418to transmit the same information. Accordingly, for applications wherethere may be limitations on transmission power, but where excessbandwidth (or transmission time) is available, alternative process 500facilitates is also particularly advantageous in such instances. Thatis, due to the unequal probabilities per symbol in encoding scheme 504,an encoding by process 500 may transmit fewer bits per symbol, but at asignificantly reduced power.

Nevertheless, assignment of, or conversion from, symbol encoding schemesaccording to the present embodiments further result in a betterpower-over-time system, such that the required battery life to upload alarge amount of data is also enhanced. Analogizing the 4-level ASKencoding scheme 504, along with table 508, to a constellation diagram,process 500 further illustrates the principles of the presentapplication where center states (e.g., constellation diagram pointsclosest to the origin) are populated with a higher probability symbolsthan outer states. Process 500 utilizes the advantageous properties ofoutgoing symbol stream 506 by assigning less probable bit sequences(e.g., 000 and 111) to symbols 502 having higher transmit power (e.g.,symbols C and D), and by assigning more probable bit sequences (e.g., 0and 1) to symbols 502 having lower transmit power (e.g., symbols A andB).

Furthermore, in the embodiments represented by FIG. 5, a person ofordinary skill in the art would recognize and appreciate that process500 is not limited for use with the equal symbol probability4-state/4-symbol QPSK scheme examples discussed herein, and that process500 more broadly represents the conversion from (or comparison with) anincoming data stream encoded with a higher order encoding scheme, havingeither equal or unequal symbol occurrence probabilities, in order tooutput a lower power probability encoding scheme.

FIG. 6 is a schematic illustration of an exemplary data distributionsystem 600 in accordance with an exemplary embodiment of the presentdisclosure. In the exemplary embodiment, data distribution system 600 isembodied within a fiber-optic communication system. Alternatively, datadistribution system 600 is embodied within, or in communication with,one or more of a wireline communication system, a wireless communicationsystem, and a communication system including a combination of differentdata transmission mediums (e.g., wireless, optical, wired). One havingordinary skill in the art would recognize and appreciate that datadistribution system 600 and associated methods and processes shown anddescribed herein are readily applicable to symbol assignment,conversion, transmission in general, and/or to data distribution systemsother than fiber-optic communication systems.

Data distribution system 600 includes a symbol transmission unit 602.Symbol transmission unit 602 includes a processor 604 and a memory 606.Symbol transmission unit 602 receives an incoming data stream (e.g.,binary string 403, FIG. 4) as an incoming data stream 608 from at leastone upstream data source (not shown), and transmits an outgoing symbolstream 610 to at least one downstream receiver (not shown). After beingreceived by symbol transmission unit 602, incoming data stream 608undergoes at least one data processing step prior to being transmittedas outgoing symbol stream 610. In the exemplary embodiment, the at leastone data processing step is performed by symbol transmission unit 602using suitable digital and/or analog electronic components, including inconjunction with processor 604 and memory 606.

Also, in the exemplary embodiment, the at least one data processing stepincludes symbol transmission process 400 and/or symbol transmissionprocess 500. In operation, in the exemplary embodiment, incoming datastream 608 includes a binary data stream of arbitrary length.Alternatively, incoming data stream 608 includes a plurality of incomingsymbols, where each incoming symbol encodes at least two bits. In caseswhere incoming data stream 608 is encoded by the plurality of incomingsymbols (e.g., of equal probability) prior to receipt by symboltransmission unit 602, the plurality of incoming symbols can beconverted into outgoing symbol stream 610 including a plurality ofoutgoing symbols of differing probabilities. For example, and withoutlimitation, with incoming data stream 608 encoded using the 4-state QPSKscheme (shown and described above with reference to FIGS. 4 and 5),symbol transmission unit 602 may implement process 400 to convertincoming symbols included with data stream 608 into outgoing symbolstream 610 of differently-encoded symbols per length of the binary datastring (e.g., the binary equivalent representation of the incomingsymbol stream). In an exemplary embodiment, the number ofdifferently-encoded symbols in outgoing symbol stream 610 is greaterthan the number unconverted signals from incoming data stream 608.

In operation, processor 604 is configured to monitor incoming datastream 608 to determine an order of incoming binary bits of data and bitsequences. In an exemplary embodiment, processor 604 is furtherconfigured to determine the prevalence, order, and sequence of bitsencoded by the incoming symbols. Referring back to FIGS. 4 and 5, forexample, processor 604 may be configured to monitor incoming data stream608 for purposes of facilitating real-time symbol assignment by symboltransmission unit 602. In an exemplary embodiment, a predefinedassignment and/or conversion program is stored as software in memory 606and is implemented by processor 604 for determining which bits and bitsequences are assigned, or which incoming symbols are to be converted,into a plurality of outgoing symbols. Optionally, memory 606 mayadditionally store a lookup table (e.g., table 508, FIG. 5) as a portionof the predefined assignment (and/or conversion) program, or as aseparate database.

In an alternative embodiment, more than one predefined assignment and/orconversion programs are stored as software in memory 606 to enablesymbol transmission unit 602 to assign a plurality of probability-basedsymbol streams 610 using at least one of process 400 and process 500. Ina further alternative embodiment, processor 604 may selectively assignor convert only a portion of the symbols from incoming data stream 608into a probability-based symbol stream, and pass through other dataaccording to conventional encoding schemes, or in the case of a receivedpre-encoded symbol stream, pass through some of the pre-encoded symbolsunconverted. In the alternative embodiment, system 600 is configured toadapt to a lower probability symbol encoding scheme where battery poweris limited, and to an equal probability encoding scheme where transmittime is limited.

In an alternative embodiment, symbol transmission unit 602 implements(e.g., using at least one of processor 604 and memory 606) an inverseoperation of process 400 and/or process 500 to convert a plurality ofincoming symbols of an incoming symbol stream to a plurality of outgoingsymbols of an outgoing symbol stream. For example, and withoutlimitation, symbol transmission unit 602 is able to convert incomingsymbol stream having, on average, lower power incoming symbols tooutgoing symbol stream having, on average, higher power outgoingsymbols. Such an inverse conversion scheme may be implemented, forexample, in instances where a portion of a fiber-optic network (or dropcable) may encounter more limited bandwidth considerations in relationto electromagnetic energy considerations.

The embodiments described herein significantly improve the accuracy ofdetermining the maximum data capacity of available communication linesin light of the available transmit power. These embodiments furtherfacilitate mitigation of the effects of signal attenuation, combinednoise, and limited transmit power on data throughput for both upstreamand downstream signals. The present embodiments also allow fordetermining more efficient data transmission techniques to utilize tomaximize data throughput in a channel where the signal to noise ratiovaries with frequency.

Through monitoring incoming signals containing data encoded by a schemeconsidering a first set of equally probable symbols, and assigning asecond set of symbols having unequal occurrence probabilities incomparison with, or by conversion from, the first set of symbols, theabove-described systems and methods provide a scalable solution forreducing the average transmit power requirement for incoming datastreams. By manipulating the Shannon-Hartley Theorem, for example, tomake certain symbols having reduced transmit power requirements moreprobable relative to other symbols in an encoded data transmission, theabove-described signal power reduction systems and methods implement asymbol assignment process to increase the power efficiency of thetransmission. Moreover, by reducing the occurrence of particular symbolshaving higher transmit power relative to other symbols, the systems andmethods described herein provide enhanced resilience of transmitted datasignals to noise and other impairments, and the ability of datatransmission systems to dynamically adapt to changing conditions.

More generally, with respect to higher order encoding schemes,including, without limitation, 16-QAM (shown and described above inFIG. 1) and greater, for data transmission where transmission energyand/or power are limited, but excess bandwidth is available,transmitting more probable, lower power symbols than lower probability,higher power symbols can be considered to be a more efficient use oflimited electromagnetic energy. Where there is excess bandwidth present,but limited electromagnetic energy and/or electrical power available fortransmitting data using that bandwidth, analogous considerations applyto the inside of a drop cable as to the inside of a fiber optic cable,and the question is not how much data can you send, but how many bitsare conveyed (without error) per joule (J) of energy.

Referring back to Table 1, in an example of a full-duplex network, when2 transmitters both transmit within the same frame, but in oppositedirections, 15 times out of 16 the transmission pulses will be receivedin different time slots. In the 16th instance, however, when the timeslots match, both respective receivers can determine (from a missing“X”) that the same timeslot was chosen by the respective transmitters atthe other end. According to this example, a similar reduced powertransmission system can effectively transmit a desired bit sequence bymanipulating the transmission timing according to similar probabilityprinciples to recover excess power transmitted with the time penalty ofconventional systems. That is, according to this embodiment, thetransmission timing can be adjusted such that the average transmissionpower is closer to 1/16 W, or 0.0625 W, for 4 bits of information, asopposed to the 0.5 W average transmission power that would be utilizedby a conventional system for the same 4 bits. In an exemplaryembodiment, a field programmable gate array (FPGA) or an integratedcircuit (IC) is implemented to execute these principles instead of ahigh speed stream processor.

An exemplary technical effect of the signal power reduction systems andmethods described herein includes at least one of: (a) providing foraccurately determining the maximum data capacity of communications linesbased on the available transmit power; (b) facilitate mitigating effectsof attenuation and combined noise, along with limited transmit power, ondata throughput for both upstream and downstream signals; (c) enablingdetermining the most power efficient data transmission technique toutilize to maximize data throughput in a wide channel where the signalto noise varies with frequency; (d) providing a scalable solution forreducing the average transmit power requirement for incoming symbolstreams encoded using 4-state and higher encoding schemes; (e) makingcertain symbols having reduced transmit power requirements more probablerelative to other symbols in an encoded data transmission, therebyincreasing the power efficiency of the transmission; (f) enhancingresilience of transmitted data signals to noise and other impairments;and (g) enabling data transmission systems to dynamically adapt tochanging conditions.

Although specific features of various embodiments may be shown in somedrawings and not in others, this is for convenience only. In accordancewith the principles of the systems and methods described herein, anyfeature of a drawing may be referenced or claimed in combination withany feature of any other drawing.

Some embodiments involve the use of one or more electronic or computingdevices. Such devices typically include a processor, processing device,or controller, such as a general purpose central processing unit (CPU),a graphics processing unit (GPU), a microcontroller, a reducedinstruction set computer (RISC) processor, an application specificintegrated circuit (ASIC), a programmable logic circuit (PLC), aprogrammable logic unit (PLU), a field programmable gate array (FPGA), adigital signal processing (DSP) device, and/or any other circuit orprocessing device capable of executing the functions described herein.The methods described herein may be encoded as executable instructionsembodied in a computer readable medium, including, without limitation, astorage device and/or a memory device. Such instructions, when executedby a processing device, cause the processing device to perform at leasta portion of the methods described herein. The above examples areexemplary only, and thus are not intended to limit in any way thedefinition and/or meaning of the term processor and processing device.

This written description uses examples to disclose the embodiments,including the best mode, and also to enable any person skilled in theart to practice the embodiments, including making and using any devicesor systems and performing any incorporated methods. The patentable scopeof the disclosure is defined by the claims, and may include otherexamples that occur to those skilled in the art. Such other examples areintended to be within the scope of the claims if they have structuralelements that do not differ from the literal language of the claims, orif they include equivalent structural elements with insubstantialdifferences from the literal language of the claims.

What is claimed is: 1.-20. (canceled)
 21. A signal transmission systemfor reducing transmission power for an encoded data stream, comprising:a receiver configured to receive an incoming data stream having a firstaverage transmit power for a plurality of incoming data bits; and asymbol scheme processor configured to assign a symbol scheme to thereceived incoming data bits of the incoming data stream according toprobabilities of occurrence of individual ones of the received databits; a first memory communicatively coupled to the symbol schemeprocessor and the receiver for storing the received incoming datastream; and a transmitter configured to transmit an outgoing data streamaccording to the assigned symbol scheme.
 22. The system of claim 21,wherein the probabilities of occurrence of individual ones of thereceived data bits are determined by a probably symbol scheme processor.23. The system of claim 21, wherein the first memory includes at leastone lookup table.
 24. The system of claim 21, wherein the symbol schemeprocessor executes a symbol scheme assignment to the incoming binary bitstream by determining the occurrence probabilities of a sequence ofindividual probabilities of received data bits.
 25. The system of claim21, wherein the assigned symbol scheme includes a non-integer entropyvalue for a number of bits assigned to one or more symbols.
 26. Thesystem of claim 21, wherein, the symbol scheme processor determines,during the assigning process, if higher power symbols are to be lessprobable than lower power symbols.
 27. The system of claim 21, wherein:the signal transmission unit receives the incoming data stream at afirst bandwidth; and transmits the outgoing data stream at a secondbandwidth greater than the first bandwidth.
 28. The system of claim 21,wherein the symbol scheme processor assigns a symbol scheme that is of alesser state scheme relative to a symbol scheme having equal probabilitystates.
 29. The system of claim 27, wherein the symbol scheme processorassigns a symbol scheme utilizing a 3-state scheme.
 30. The system ofclaim 27, wherein the symbol scheme processor assigns a symbol schemewhich represents a one-dimensional constellation diagram, such that thesymbol scheme has equal probability states represents a two-dimensionalconstellation diagram.
 31. The system of claim 21, wherein the symbolscheme processor assigns an ASK symbol scheme to the incoming datastream.
 32. The system of claim 21, wherein the symbol scheme processorutilizes a ratio of 3:5 or lower of the second average transmit power tothe first average transmit power.
 33. The system of claim 31, whereinthe symbol scheme processor utilizes a ratio 1:2 or lower of the secondaverage transmit power to the first average transmit power.
 34. Thesystem of claim 21, wherein the signal transmission unit receives theincoming data stream encoded using an encoding scheme including at leastone of quadrature amplitude modulation (QAM), quadrature phase shiftkeying (QPSK), amplitude shift keying (ASK), and binary amplitude shiftkeying (BASK).
 35. The system of claim 21, wherein the symbol schemeprocessor transmits the first portion of the plurality of outgoingsymbols at lower power than the second portion of the plurality ofoutgoing symbols.
 36. The system of claim 21, wherein the symbol schemeprocessor optionally assigns a symbol scheme that implements anon-uniform number of bits per symbol.
 37. The system of claim 35,wherein the symbol scheme processor receives an incoming data streamthat includes an incoming symbol scheme implementing a uniform number ofbits per symbol.
 38. The system of claim 21, wherein symbol schemeprocessor assigns a symbol scheme that implements a non-integer numberof bits per symbol.
 39. The system of claim 37, wherein the non-integernumber of bits per symbol is selected from the group consisting of 1.5and 1.811.
 40. The system of claim 21, further comprising softwarestored in a second memory and executable by the symbol scheme processorfor reducing the transmission energy requirements of a signaltransmission.
 41. The system of claim 30, wherein the software isfirmware executable by the processor.
 42. The system of claim 30,wherein the second memory is the first memory.
 43. The system of claim30, wherein the second memory is a memory for storing firmware.
 44. Thesystem of claim 30, wherein a symbol scheme is assigned to the receiveddata bits of the incoming data stream according to probabilities ofoccurrence of individual ones of the received data bits by the receiver.45. The system of claim 30, wherein the probabilities of occurrence of asequence of the individual ones of the received data bits are determinedby the symbol scheme processor.